Implementing Prioritized Merging with ASP
نویسندگان
چکیده
منابع مشابه
The Non-archimedean Polynomials and Merging of Stratified Knowledge Bases
In this paper, a new algebraic representation by the non-Archimedean fields is proposed to model stratified/ranked knowledge bases. The non-Archimedean representation is in the form of the non-Archimedean polynomials. With the nonArchimedean representation, the most widely used ordering strategies are easily induced and compared. Moreover, a framework of prioritized merging operators using the ...
متن کاملA Model-based Approach for Merging Prioritized Knowledge Bases in Possibilistic Logic
This paper presents a new approach for merging prioritized knowledge bases in possibilistic logic. Our approach is semantically defined by a model-based merging operator in propositional logic and the merged result of our approach is a normal possibility distribution. We also give an algorithm to obtain the syntactical counterpart of the semantic approach. The logical properties of our approach...
متن کاملAn Argumentation Framework for Merging Conflicting Knowledge Bases: The Prioritized Case
An important problem in the management of knowledge-based systems is the handling of inconsistency. Inconsistency may appear because the knowledge may come from different sources of information. To solve this problem, two kinds of approaches have been proposed. The first category merges the different bases into a unique base, and the second category of approaches, such as argumentation, accepts...
متن کاملOntology Merging using Answer Set Programming and Linguistic Knowledge
With the increasing number of ontologies available on the web, the problem of merging ontologies from different sources to interoperate applications becomes important. This paper presents a novel approach for merging of light-weight ontologies based on answer set programming (ASP) and linguistic background knowledge. ASP provides a declarative execution environment for intuitive merging rules. ...
متن کاملMin-based Assertional Merging Approach for Prioritized DL-Lite Knowledge Bases
DL-Lite is a powerful and tractable family of description logics specifically tailored for applications that use huge volumes of data. In many real world applications, data are often provided by several and potentially conflicting sources of information having different levels of priority. Possibility theory offers a very natural framework to deal with ordinal and qualitative uncertain beliefs ...
متن کامل